Approximating vector quantisation by transformation and scalar quantisation
نویسندگان
چکیده
منابع مشابه
Approximating vector quantisation by transformation and scalar quantisation
Vector quantization provides better ratedistortion performance over scalar quantization even for a random vector with independent dimensions. However, the design and implementation complexity of vector quantizers is much higher than that of scalar quantizers. To reduce the complexity while achieving performance close to optimal vector quantization and better than scalar quantization, we propose...
متن کاملGenerative Vector Quantisation
{ Based on the assumption that a pattern is constructed out of features which are either fully present or absent, we propose a vector quantisation method which constructs patterns using binary combinations of features. For this model there exists an eecient EM-like learning algorithm which learns a set of representative codebook vectors. In terms of a generative model, the collection of allowed...
متن کاملVector quantisation based image enhancement
We present a new algorithm for rescaling images inspired by fractal coding. It uses a statistical model of the relationship between detail at different scales of the image to interpolate detail at one octave above the highest spatial frequency in the original image. We compare it with Bspline and bilinear interpolation techniques and show that it yields a sharper looking rescaled image.
متن کاملVector Quantisation Classiiers for Handwritten Character Recognition Vector Quantisation Classiiers for Handwritten Character Recognition
The development of a pattern recognition architecture based on vector quantization techniques is presented which is applied to the recognition of handwritten bank forms. After an overview of nearest-neighbor classiication and clustering, a fast completely binary version of the k-means algorithm is introduced and results for large character databases are given. An integration of these methods in...
متن کاملHierarchical Binary Vector Quantisation Classi ers
We report on a hierarchical nearest-neighbor classiier algorithm which we conceived for the recognition of handwritten characters. Distances to all classes are used both as a decision criterion in the classiication hierarchy and for generating class membership coeecients. These likelihood values can be easily integrated in a multi-agent cognitive environment. We introduce a new completely binar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2014
ISSN: 1751-8636,1751-8636
DOI: 10.1049/iet-com.2012.0684